´ ry Research Group Egerva on Combinatorial Optimization Technical reportS TRPublished by the Egerv´ary Research Group, P´azm´any P. s´et´any 1/C,

Source URL: www.cs.elte.hu

Magnús Már Halldórsson ICE-TCS, School of Computer Science Reykjavik University 101 Reykjavik, Iceland

Source URL: www.ru.is

• Computational complexity theory
• NP-complete problems
• Combinatorial optimization
• Theoretical computer science
• Maximum cut
• Approximation algorithm
• International Colloquium on Automata
• Languages and Programming
• Algorithmica
• Halldrsson
• International Symposium on Algorithms and Computation
• European Symposium on Algorithms
• Graph coloring

Sampling-based Path Planning on Configuration-Space Costmaps L´eonard Jaillet, Juan Cort´es and Thierry Sim´eon Abstract—This paper addresses path planning considering a cost function defined over the configuration

Source URL: homepages.laas.fr

• Search algorithms
• Mathematics
• Routing algorithms
• Information science
• Information retrieval
• Edsger W. Dijkstra
• Combinatorial optimization
• Robot navigation
• A* search algorithm
• Shortest path problem
• Motion planning
• Rapidly-exploring random tree

Metaheuristics for Transport and Logistics Andrea E. Rizzoli, IDSIA Luca Maria Gambardella, IDSIA Conference paper STRC 2002

Source URL: www.strc.ch

• Operations research
• Mathematical optimization
• Metaheuristics
• Luca Maria Gambardella
• Search algorithms
• Ant colony optimization algorithms
• Dalle Molle Institute for Artificial Intelligence Research
• Genetic algorithm
• Combinatorial optimization
• Tabu search
• Artificial ants
• Travelling salesman problem

Graph Matching with Anchor Nodes: A Learning Approach Nan Hu Raif M. Rustamov Leonidas Guibas Stanford University

Source URL: geometry.stanford.edu

• Combinatorial optimization
• Graph theory
• Matching
• Graph
• Hypergraph
• Graph operations
• NP-complete problems
• Bipartite double cover
• Line graph

Efficient Densest Subgraph Computation in Evolving Graphs Alessandro Epasto∗ Silvio Lattanzi

Source URL: www.epasto.org

• Graph theory
• Mathematics
• Spanning tree
• Dense subgraph
• Graph coloring
• Combinatorial optimization
• Routing algorithms
• Line graph
• Tree-depth

Combinatorial Optimization Modelling, Computation and Optimization in Information Systems and Management Sciences (MCOMay 11-13, 2015, Metz, France http://lita.sciences.univ-metz.fr/iccsama2015/MCO/index.php

Source URL: www.lita.univ-lorraine.fr

WORKSHOP ON WEB PERSONALIZATION, RECOMMENDER SYSTEMS AND SOCIAL MEDIA, Spoilers Ahead - Personalized Web Filtering Pascal Bissig, Philipp Brandes, Roger Wattenhofer, Roman Willi

Source URL: www.tik.ee.ethz.ch

• Operations research
• Combinatorial optimization
• Cryptography
• Knapsack problem
• Email spam
• Bloom filter

Chapter 3 Matroids Several combinatorial optimization problems can be formulated in terms of independence systems. More specifically in terms of matroids. If this is the case, we are in a very comfortable position, beca

Source URL: www2.informatik.hu-berlin.de

Combinatorial Optimization: Exact and Approximate Algorithms Luca Trevisan Stanford University March 19, 2011

Source URL: www.eecs.berkeley.edu